GATE PYQ

C Programming

Q131.
Which of the following is true with respect to Reference?

Q132.
The output of the following C program is__________. void f1(int a, int b) { int c; c=a; a=b; b=c; } void f2(int a, int b) { int c; c=a; a=b; b=c; } int main(){ int a=4, b=5, c=6; f1(a,b); f2(&b, &c); printf("%d",c-a-b); }

Q133.
Consider the following function written in the C programming language. void foo(char a){ if ( a && a != ' '){ foo(a+1); putchar(a); } } The output of the above function on input "ABCD \; \; EFGH" is

Q134.
Suppose c=(c[0],...,c[k-1]) is an array of length k, where all the entries are from the set {0,1}. For any positive integers a and n, consider the following pseudocode. If k=4, c=(1,0,1,1), a=2 and n=8, then the output of DOSOMETHING(c,a,n) is _____.

Q135.
Consider the following recursive C function. void get(int n) { if (n<1) return; get(n-1); get(n-3); printf("%d", n); } If get(6) function is being called in main()then how many times will the get()function be invoked before returning to the main()?

Q136.
Consider the following function double f (double x) { if ( abs (x*x - 3) < 0. 01) return x; else return f (x / 2 + 1.5/x); } Give a value q (to 2 decimals) such that f(q) will return q:______

Q137.
Consider the following pseudo code. What is the total number of multiplications to be performed? D= 2 for i = 1 to n do for j = i to n do for k = j + 1 to n do D = D * 3

Q138.
Consider the following segment of C-code: int j, n; j = 1; while (j <=n) j=j*2; The number of comparisons made in the execution of the loop for any n \gt 0 is:

Q139.
Consider the following C function. float f(float x, int y) { float p, s; int i; for (s=1, p=1, i=1; i < y; i ++) { p*= x/i; s+=p; } return s; } For large values of y, the return value of the function f best approximates

Q140.
Consider the following C function in which size is the number of elements in the array E: int MyX(int *E, unsigned int size) { int Y = 0; int Z; int i, j, k; for(i = 0; i < size; i++) Y = Y + E[i]; for(i = 0; i < size; i++) for(j = i; j < size; j++) { Z = 0; for(k = i; k <= j; k++) Z= Z + E[k]; if (Z > Y) Y = Z; } return Y; } The value returned by the function MyX is the